Theory and Algorithm for Planar Datum Establishment Using Constrained Total Least-squares
نویسندگان
چکیده
منابع مشابه
On the equivalence of constrained total least squares and structured total least squares
Several extensions of the total least squares (TIS) method that are able to calculate a structured rank deficient approximation of a data matrix have been developed recently. The main result of this correspondence is the demonstration of the equivalence of two of these approaches, namely, the constrained total least squares (CTLS) approach and the structured total least squares (STLS) approach....
متن کاملWeighted total least squares formulated by standard least squares theory
This contribution presents a simple, attractive, and exible formulation for the weighted total least squares (WTLS) problem. It is simple because it is based on the well-known standard least squares theory; it is attractive because it allows one to directly use the existing body of knowledge of the least squares theory; and it is exible because it can be used to a broad eld of applications in t...
متن کاملUnifying Least Squares, Total Least Squares and Data Least Squares
The standard approaches to solving overdetermined linear systems Ax ≈ b construct minimal corrections to the vector b and/or the matrix A such that the corrected system is compatible. In ordinary least squares (LS) the correction is restricted to b, while in data least squares (DLS) it is restricted to A. In scaled total least squares (Scaled TLS) [15], corrections to both b and A are allowed, ...
متن کاملA Regularized Total Least Squares Algorithm
Error-contaminated systems Ax ≈ b, for which A is ill-conditioned, are considered. Such systems may be solved using Tikhonov-like regularized total least squares (R-TLS) methods. Golub et al, 1999, presented a direct algorithm for the solution of the Lagrange multiplier formulation for the R-TLS problem. Here we present a parameter independent algorithm for the approximate R-TLS solution. The a...
متن کاملA POCS-based constrained total least squares algorithm for image restoration
In image restoration, the region of support of the point spread function is often much smaller than the size of the observed degraded image and this property is utilized in many image deconvolution algorithms. For the constrained total least squares (CTLS)-based algorithm, it means that the solution of the CTLS algorithm should retain the block-circulant and sparse structure of the degradation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia CIRP
سال: 2016
ISSN: 2212-8271
DOI: 10.1016/j.procir.2016.02.104